Polar Codes and Polar Lattices for the Heegard–Berger Problem
نویسندگان
چکیده
منابع مشابه
Polar Codes and Polar Lattices for the Heegard-Berger Problem
Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the doubly-symmetric binary sources when the side information may be absent. The nested structure contains two optimal polar codes for lossy source coding and channel c...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملConstruction of Capacity-Achieving Lattice Codes: Polar Lattices
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity 1 2 log(1+ SNR) of the additive white Gaussian-noise (AWGN) channel for any signal-to-noise ratio (SNR). Our construction follows the multilevel approach of Forney et al., where on each level we construct a capacityachieving polar code. The component polar codes are nat...
متن کاملLocally Polar Lattices
A lattice 9 is locally polar if each element is a join of points (atoms) and each interval L?$ = (y j x < y}, x a point, is a polar space (see Tits [6] or Buekenhout and Shult [4]). Recall that the rank of a polar space is the maximum projective dimension of an element; since this number is finite, 9 has a 1 and a 0. There is an obvious dimension function on 9, so lines and planes have the obvi...
متن کاملPolarization and Polar Codes
This tutorial treats the fundamentals of polarization theory and polar coding. Arıkan’s original results on binary source and channel polarization methods are studied. Error probability and complexity analyses are offered. The original results are generalized in several directions. Early developments in the field are discussed, pointers to some of the important work omitted from this tutorial a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2018
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2018.2832618